On cardinality constrained polymatroids
نویسندگان
چکیده
منابع مشابه
Cardinality Constrained Portfolio Optimisation
The traditional quadratic programming approach to portfolio optimisation is difficult to implement when there are cardinality constraints. Recent approaches to resolving this have used heuristic algorithms to search for points on the cardinality constrained frontier. However, these can be computationally expensive when the practitioner does not know a priori exactly how many assets they may des...
متن کاملOn the cardinality constrained matroid polytope
Given a combinatorial optimization problem Π and an increasing finite sequence c of natural numbers, we obtain a cardinality constrained version Πc of Π by permitting only those feasible solutions of Π whose cardinalities are members of c. We are interested in polyhedra associated with those problems, in particular in inequalities that cut off solutions of forbidden cardinality. Maurras [11] an...
متن کاملOn cardinality constrained cycle and path polytopes
Given a directed graph D = (N, A) and a sequence of positive integers 1 ≤ c1 < c2 < · · · < cm ≤ |N |, we consider those path and cycle polytopes that are defined as the convex hulls of simple paths and cycles of D of cardinality cp for some p ∈ {1, . . . , m}, respectively. We present integer characterizations of these polytopes by facet defining linear inequalities for which the separation pr...
متن کاملOn a cardinality-constrained transportation problem with market choice
It is well-known that the intersection of the matching polytope with a cardinality constraint is integral [8]. We prove a similar result for the polytope corresponding to the transportation problem with market choice (TPMC) (introduced in [4]) when the demands are in the set {1, 2}. This result generalizes the result regarding the matching polytope and also implies that some special classes of ...
متن کاملOn two relaxations of quadratically-constrained cardinality minimization
This paper considers a quadratically-constrained cardinality minimization problem with applications to digital filter design, subset selection for linear regression, and portfolio selection. Two relaxations are investigated: the continuous relaxation of a mixed integer formulation, and an optimized diagonal relaxation that exploits a simple special case of the problem. For the continuous relaxa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.10.007